Formalization of closure properties for context-free grammars
نویسندگان
چکیده
Context-free language theory is a well-established area of mathematics, relevant to computer science foundations and technology. This paper presents the preliminary results of an ongoing formalization project using context-free grammars and the Coq proof assistant. The results obtained so far include the representation of context-free grammars, the description of algorithms for some operations on them (union, concatenation and closure) and the proof of related theorems (e.g. the correctness of these algorithms). A brief survey of related works is presented, as well as plans for further development.
منابع مشابه
Context-Free Language Theory Formalization
Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program development. Different tools are being increasingly used in order to accelerate and simplify proof checking. Context-free language theory is a well-established area of mathematics, relevant to computer science founda...
متن کاملFormalization of context-free language theory
Context-free language theory is a subject of high importance in computer language processing technology as well as in formal language theory. This paper presents a formalization, using the Coq proof assistant, of fundamental results related to context-free grammars and languages. These include closure properties (union, concatenation and Kleene star), grammar simplification (elimination of usel...
متن کاملOn the Formalization of Some Results of Context-Free Language Theory
This work describes a formalization effort, using the Coq proof assistant, of fundamental results related to the classical theory of context-free grammars and languages. These include closure properties (union, concatenation and Kleene star), grammar simplification (elimination of useless symbols, inaccessible symbols, empty rules and unit rules), the existence of a Chomsky Normal Form for cont...
متن کاملGrammars with Regulated Rewriting
Context-free grammars are not able to cover all linguistic phenomena. Thus we define some types of grammars where context-free rules are used and restriction imposed on the derivations. We illustrate the concepts by example, compare the generative power, give some closure and decidability properties and basic facts on syntactic complexity.
متن کاملSequential grammars and automata with valences
We discuss the model of valence grammars, a simple extension of context-free grammars. We show closure properties of context-free valence languages over arbitrary monoids. Chomsky and Greibach normal form theorems and an iteration lemma for context-free valence grammars over the groups Z are proved. The generative power of di4erent control monoids is investigated. In particular, we show that co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1506.03428 شماره
صفحات -
تاریخ انتشار 2015